On minimal asymptotic bases
نویسندگان
چکیده
منابع مشابه
Minimal Asymptotic Bases for the Natural Numbers
The sequence A of nonnegative integers is an asymptotic basis of order h if every sufficiently large integer can be written as the sum of h elements of A . Let MhA denote the set of elements that have more than one representation as a sum of h elements of A . It is proved that there exists an asymptotic basis A such that MhA (x) = O(x1-1 11 +E) for every e > 0. An asymptotic basis A of order h ...
متن کاملIndependence of solution sets and minimal asymptotic bases
(4) 0 < a1 < a2 < . . . < ak and ai ∈ A for i = 1, . . . , k. The set A is called an asymptotic basis of order k if there exists a natural number n1 such that rA(n) > 0 for all n ≥ n1. The set A is called a strict asymptotic basis of order k if there exists a natural number n1 such that r′ A(n) > 0 for all n ≥ n1. All bases considered in this paper will be either asymptotic or strict asymptotic...
متن کاملOn Sidon sets and asymptotic bases
Erdős conjectured the existence of an infinite Sidon sequence of positive integers which is an asymptotic basis of order 3. We progress towards this conjecture in several directions. We prove the conjecture for all cyclic groups ZN with N large enough. We also show that there is an infinite B2[2] sequence which is an asymptotic basis of order 3. Finally, we prove that for any ε > 0 there is a S...
متن کاملNotes on computing minimal approximant bases
When s = 1 and N = ‖n‖ − 1 this is the classical Hermite Padé approximation problem. Here we allow N to be arbitrary. We describe algorithms for computing an order N genset of type n: a matrix V ∈ k[x]∗×m such that every row of V is a solution to (1) and every solution P of (1) can be expressed as a k[x]-linear combination of the rows of V . Ideally, V will be a minbasis of solutions: V has ful...
متن کاملOn the Computation of Minimal Polynomial Bases
The problem of determination of a minimal polynomial basis of a rational vector space is the starting point of many control analysis, synthesis and design techniques. In this paper, we propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s). The proposed method exploits the structure of the left null space of generalized W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2011
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.06.002